Covering random graphs with monochromatic trees
نویسندگان
چکیده
Given an r $$ -edge-colored complete graph K n {K}_n , how many monochromatic connected components does one need in order to cover its vertex set? This natural question is a well-known essentially equivalent formulation of the classical Ryser's conjecture which, despite lot attention over last 50 years, still remains open. A number recent papers consider sparse random analogue this question, asking for minimum needed set
منابع مشابه
Partitioning complete multipartite graphs by monochromatic trees
The tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum number k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. We determine t2(K(n1, n2, . . . , nk)) of the complete k-partite graph K(n1, n2, . . . , nk). In particular, we prove that t2(K(n,m)) = (m − 2)/2n + 2, whe...
متن کاملPartitioning Random Graphs into Monochromatic Components
Erdős, Gyárfás, and Pyber (1991) conjectured that every r-colored complete graph can be partitioned into at most r − 1 monochromatic components; this is a strengthening of a conjecture of Lovász (1975) and Ryser (1970) in which the components are only required to form a cover. An important partial result of Haxell and Kohayakawa (1995) shows that a partition into r monochromatic components is p...
متن کاملRandom Trees in Random Graphs
We show that a random labeled n-vertex graph almost surely contains isomorphic copies of almost all labeled n-vertex trees, in two senses. In the first sense, the probability of each edge occurring in the graph diminishes as n increases, and the set of trees referred to as "almost all" depends on the random graph. In the other sense, the probability of an edge occurring is fixed, and the releva...
متن کاملCovering Graphs Using Trees and Stars
A tree cover of a graph G is defined as a collection of trees such that their union includes all the vertices of G. The cost of a tree cover is the weight of the maximum weight tree in the tree cover. Given a positive integer k, the k-tree cover problem is to compute a minimum cost tree cover which has no more than k trees. Star covers are defined analogously. Additionally, we may also be provi...
متن کاملCovering Directed Graphs by In-Trees
Given a directed graphD = (V,A) with a set of d specified vertices S = {s1, . . . , sd} ⊆ V and a function f : S → Z+ where Z+ denotes the set of non-negative integers, we consider the problem which asks whether there exist ∑d i=1 f(si) in-trees denoted by Ti,1, Ti,2, . . . , Ti,f(si) for every i = 1, . . . , d such that Ti,1, . . . , Ti,f(si) are rooted at si, each Ti,j spans vertices from whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2022
ISSN: ['1042-9832', '1098-2418']
DOI: https://doi.org/10.1002/rsa.21120